Maude as a Formal Meta-tool

Given the diierent perspectives from which a complex software system has to be analyzed, the multiplicity of formalisms is in some sense unavoidable. This poses two important technical challenges: how to rigorously meet the need to interrelate formalisms, and how to reduce the duplication of eeort in tool and speciication building across formalisms. These challenges could be answered by adequate formal meta-tools that, when given the speciication of a formal inference system, generate an eecient inference engine, and when given a speciication of two formalism and a translation, generate an actual translator between them. Similarly, module composition operations that are logic-independent, but that at present require costly implementation eeorts for each formalism could be provided for logics in general by module algebra generator meta-tools. The foundations of meta-tools of this kind can be based on a meta-theory of general logics. Their actual design and implementation can be based on appropriate logical frameworks having eecient implementations. This paper explains how the reeective logical framework of rewriting logic can be used, in conjunction with an ee-cient reeective implementation such as the Maude language, to design formal meta-tools such as those described above. The feasibility of these ideas and techniques has been demonstrated by a number of substantial experiments in which new formal tools and new translations between formalisms, eecient enough to be used in practice, have been generated.